输入一个二维数组A[5][5],将其所有元素排序后按从小到大存放

#include <stdio.h>
#include <memory.h>
#include <stdlib.h>
int compare(const void *a, const void *b)
{
return *(const int*)a > *(const int *)b;
}
int main()
{
int A[5][5];
int i, j;

for (i = 0; i < 5; i++)
for (j = 0; j < 5; j++)
A[i][j] = rand()%100;

qsort(A, 25, sizeof(A[0][0]), compare);

for (i = 0; i < 5; i++)
for (j = 0; j < 5; j++)
printf("%d\n", A[i][j]);

return 0;
}

#include <iostream>
using namespace std;

void QuickSort(int *Array, int left, int right){
int l = left, r = right, mid = Array[(l+r)/2];
while (l<=r){
while (Array[l]<mid) l++;
while (Array[r]>mid) r--;

if (l<=r){
swap(Array[l], Array[r]);
l++,r--;
}
}
if (l<right) QuickSort(Array, l, right);
if (r>left) QuickSort(